@InProceedings{MauriRibeLoreLapo:2013:AdLaNe,
               author = "Mauri, Geraldo Regis and Ribeiro, Glaydston Mattos and Lorena, 
                         Luis Antonio Nogueira and Laporte, Gilbert",
          affiliation = "{Federal University of Esp{\'{\i}}rito Santo – UFES} and 
                         {Federal University of Esp{\'{\i}}rito Santo – UFES} and 
                         {Instituto Nacional de Pesquisas Espaciais (INPE)} and {CIRRELT 
                         and HEC Montr{\'e}al}",
                title = "An adaptive large neighborhood search heuristic for the berth 
                         allocation problem",
            booktitle = "Abstracts...",
                 year = "2013",
         organization = "Euro/informs- European Conference On Operational Research, 26.",
             keywords = "Port Operations, Metaheuristics, Combinatorial Optimization.",
             abstract = "The Berth Allocation Problem (BAP) consists of assigning ships to 
                         berthing areas along a quay in a port. The choice of where and 
                         when the ships shall moor is the main decision to be made in this 
                         problem. In this paper, the ships are represented as rectangles to 
                         be placed into a space x time area avoiding overlaps and 
                         satisfying time window constraints. To solve the BAP, an Adaptive 
                         Large Neighborhood Search heuristic (ALNS) is proposed for the 
                         discrete and continuous cases which provides good solutions, 
                         outperforming recent methods found in the literature.",
  conference-location = "Roma, It{\'a}lia",
      conference-year = "July 1-4, 2013",
                label = "self-archiving-INPE-MCTI-GOV-BR",
             language = "en",
           targetfile = "BAP_EURO2013_Mauri et al.pdf",
        urlaccessdate = "07 maio 2024"
}